A random walk approach to quantum algorithms
نویسندگان
چکیده
منابع مشابه
A random walk approach to quantum algorithms.
The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial; pure quantum dynamics is deterministic, so randomness only enters during the measurement phase, i.e. when converting the quantum information into classical information. The ou...
متن کاملOptimized quantum random-walk search algorithms
Shenvi, Kempe and Whaley’s quantum random-walk search (SKW) algorithm [2003 Phys. Rev. A 67 052307] is known to require O( √ N) number of oracle queries to find the marked element, where N is the size of the search space. This scaling is thought to be the best achievable on a quantum computer. We prove that the final state of the quantum walk in the SKW algorithm yields the nearest neighbours o...
متن کاملFrom quantum master equation to random walk
It is shown in this paper that the quantum master equation can be mapped to a modified continuous time random walk (CTRW) if the relaxation term is composed of transitions over a set of states. When the Hamiltonian is time-independent and transitions are between its eigenlevels, such a modified CTRW reduces to the Markovian walk equivalent to the Pauli master equation. On the other hand, the me...
متن کاملQuantum Random Walk via Classical Random Walk With Internal States
In recent years quantum random walks have garnered much interest among quantum information researchers. Part of the reason is the prospect that many hard problems can be solved efficiently by employing algorithms based on quantum random walks, in the same way that classical random walks have played a central role in many hugely successful randomized algorithms. In this paper we introduce a new ...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
سال: 2006
ISSN: 1364-503X,1471-2962
DOI: 10.1098/rsta.2006.1901